Thinning algorithms for scattered data interpolation
نویسنده
چکیده
Multistep interpolation of scattered data by compactly supported radial basis functions requires hierarchical subsets of the data. This paper analyzes thinning algorithms for generating evenly distributed subsets of scattered data in a given domain in IR. AMS subject classification: 41A15, 65D05, 65D07.
منابع مشابه
Advances in Digital Image Compression by Adaptive Thinning
This paper proposes a novel concept for digital image compression. The resulting compression scheme relies on adaptive thinning algorithms, which are recent multiresolution methods from scattered data approximation. Adaptive thinning algorithms are recursive point removal schemes, which are combined with piecewise linear interpolation over decremental Delaunay triangulations. This paper shows t...
متن کاملThinning and Approximation of Large Sets of Scattered Data
Having various concrete industrial applications in mind we focus on surface fitting to large scattered data sets. We describe a general method for modelling data which incorporates both filtering using triangulations, and hierarchical interpolation based on compactly supported radial basis functions. The uniformity of the data points plays a significant role. The utility of the method is confir...
متن کاملAn Adaptive Method for Choosing Center Sets of RBF Interpolation
Radial basis functions (RBF) provide powerful meshfree methods for multivariate interpolation for scattered data. RBF methods have been praised for their simplicity and ease of implementation in multivariate scattered data approximation. But both the approximation quality and stability depend on the distribution of the center set. It leads immediately to the problem of finding good or even opti...
متن کاملMultiscale kernels
This paper reconstructs multivariate functions from scattered data by a new multiscale technique. The reconstruction uses standard methods of interpolation by positive definite reproducing kernels in Hilbert spaces. But it adopts techniques from wavelet theory and shift–invariant spaces to construct a new class of kernels as multiscale superpositions of shifts and scales of a single compactly s...
متن کاملThinning, Inserting, and Swapping Scattered Data
Thinning, insertion, and swapping algorithms for generating well-distributed hierarchical subsets of scattered data in a given domain in IR are proposed. It is found that thinning and insertion yield approximately similar results but that swapping is in general inferior.
متن کامل